Random graph model with power-law distributed triangle subgraphs
نویسندگان
چکیده
منابع مشابه
Distributed Power-law Graph Computing Distributed Power-law Graph Computing: Theoretical and Empirical Analysis∗
Typically, a large-scale natural graph follows a skewed power law. In distributed graphstructured computations, the skewness usually makes a bad partitioning, which leads to high communication cost and workload imbalance. Therefore, graph partitioning (GP) is a challenging issue. To tackle this challenge, we introduce degree-based techniques into GP via vertex-cut. Accordingly, we develop a nov...
متن کاملA Random Graph Model for Power Law Graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences which satisfy a power law. This model involves only a small number of parameters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from these parameters, various properties of the graph can be derived. For exam...
متن کاملTriangle-Free Subgraphs of Random Graphs
The Andrásfai–Erdős–Sós Theorem [2] states that all triangle-free graphs on n vertices with minimum degree strictly greater than 2n/5 are bipartite. Thomassen [11] proved that when the minimum degree condition is relaxed to ( 3 + ε)n, the result is still guaranteed to be rε-partite, where rε does not depend on n. We prove best possible random graph analogues of these theorems.
متن کاملLoglog distances in a power law random intersection graph
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...
متن کاملLarge Cliques in a Power-law Random Graph
We study the size of the largest clique ω(G(n, α)) in a random graphG(n, α) on n vertices which has power-law degree distribution with exponent α. We show that for ‘flat’ degree sequences with α > 2 whp the largest clique in G(n, α) is of a constant size, while for the heavy tail distribution, when 0 < α < 2, ω(G(n, α)) grows as a power of n. Moreover, we show that a natural simple algorithm wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.72.025103